Constructing Sorting Networks from k-Sorters

We study the problem of using sorters of k vabxes to form large sorting and merging networks. For n an integral power of k, we show how to merge k sorted vectors of length n/k each using 4 log, n 3 layers of k-sorters and 4 log* n 5 layers of k=ittiqut binary mergers. As a result, we show how to sort R v&es using 2 iag$ n -log, n layers of k-sorters and 2 logf n 3 fog& n * I fayers of k-input l;inar)r mergers.